Linear Complementarity and P-Matrices for Stochastic Games
نویسندگان
چکیده
We define the first nontrivial polynomially recognizable subclass of P-matrixGeneralized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No such classes/rules were previously known. We show that a subclass of Shapley turn-based stochastic games, subsuming Condon’s simple stochastic games, is reducible to the new class of GLCPs. Based on this we suggest the new strongly subexponential combinatorial algorithms for these games.
منابع مشابه
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
We show that the problem of finding optimal strategies for both players in a simple stochastic game reduces to the generalized linear complementarity problem (GLCP) with a P-matrix, a well-studied problem whose hardness would imply NP = co-NP. This makes the rich GLCP theory and numerous existing algorithms available for simple stochastic games. As a special case, we get a reduction from binary...
متن کاملA Strongly Polynomial Reduction for Linear Programs over Grids
We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems, moreover, share their combinatorial structure with discounted Markov decision processes (MDPs). Through proposing reduction schemes for the GLCP, we obtain a strongly polynomial reduction from Grid-LPs to linear progr...
متن کاملContinuous local search Citation
We introduce CLS, for continuous local search, a class of polynomial-time checkable total functions that lies at the intersection of PPAD and PLS, and captures a particularly benign kind of local optimization in which the domain is continuous, as opposed to combinatorial, and the functions involved are continuous. We show that this class contains several well known intriguing problems which wer...
متن کاملP D - Matrices and Linear Complementarity Problems
Motivated by the definition of P†-matrix ([9]), another generalization of a P -matrix for square singular matrices called PD-matrix is proposed first. Then the uniqueness of solution of Linear Complementarity Problems for square singular matrices is proved using PD-matrices. Finally some results which are true for P -matrices are extended to PD-matrices.
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کامل